منابع مشابه
Symmetric ILP: Coloring and small integers
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary variables. Orthogonal array construction and coloring problems are used as illustrations.
متن کاملExploiting orbits in symmetric ILP
This paper describes components of a branch-and-cut algorithm for solving integer linear programs having a large symmetry group. It describes an isomorphism pruning algorithm and variable setting procedures using orbits of the symmetry group. Pruning and orbit computations are performed by backtracking procedures using a Schreier-Sims table for representing the symmetry group. Applications to h...
متن کاملOn a Binary-Encoded ILP Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficient separation algorithm for general block inequalities, (ii) an efficient LP-based separation algorithm for stars (i.e., the all-different polytope), (iii) introduction of matching inequalities, (iv) introduction of s...
متن کاملSymmetric Somewhat Homomorphic Encryption over the Integers
We describe a symmetric variant of homomomorphic encryption scheme by van Dijk et al. [DGHV10], semantically secure under the error-free approximate-GCD problem. We also provide the implementation of the scheme as a C/C++ library. The scheme allows to perform “mixed” homomorphic operations on ciphertexts and plaintexts, eliminating the need to encrypt new ciphertexts using the public key for so...
متن کاملSymmetric 1−dependent colorings of the integers
In a recent paper, we constructed a stationary 1−dependent 4−coloring of the integers that is invariant under permutations of the colors. This was the first stationary finitely dependent q−coloring for any q. When the analogous construction is carried out for q > 4 colors, the resulting process is not finitely dependent. We construct here a process that is symmetric in the colors and 1−dependen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.10.008